Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
نویسندگان
چکیده
We consider some Riordan arrays related to binary words avoiding a pattern which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow us to define every element as a linear combination of other elements in the array; the A-sequence is unique while the A-matrix is not. However, for the problems considered in the present paper, we show that the A-matrix approach is more convenient. We provide explicit algebraic generating functions for these Riordan arrays and obtain many statistics on the corresponding languages.
منابع مشابه
Binary words excluding a pattern and proper Riordan arrays
We study the relation between binary words excluding a pattern and proper Riordan arrays. In particular, we prove necessary and sufficient conditions under which the number of words counted with respect to the number of zeroes and ones bits are related to proper Riordan arrays. We also give formulas for computing the generating functions (d(x), h(x)) defining the Riordan array.
متن کاملBinary words avoiding a pattern and marked succession rule
In this paper we study the enumeration and the construction of particular binary words avoiding the pattern 10. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule, called jumping and marked succession rule, which describes the growth of such words according to their number of ones. Moreover, the problem of associating a word to a ...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملBinary Words Avoiding xxx and Strongly Unimodal Sequences
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxxR was intermediate between polynomial and exponential. We now show that the same result holds for the growth of the number of binary words avoiding the pattern xxRx. Curiously, the analysis for xxRx is much simpler than that for xxxR. We derive our results by giving a bijection be...
متن کاملMatrix Characterizations of Riordan Arrays
Here we discuss two matrix characterizations of Riordan arrays, P -matrix characterization and A-matrix characterization. P -matrix is an extension of the Stieltjes matrix defined in [25] and the production matrix defined in [7]. By modifying the marked succession rule introduced in [18], a combinatorial interpretation of the P -matrix is given. The P -matrix characterizations of some subgroups...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011